Computers and Intractability: A Guide to the Theory of NP-Completeness
نویسندگان
چکیده
منابع مشابه
Complexity Theory
The main text for the course is: Computational Complexity. Christos H. Papadimitriou. Introduction to the Theory of Computation. Michael Sipser. Other useful references include: Computers and Intractability: A guide to the theory of NP-completeness. Michael R. Garey and David S. Johnson. Structural Complexity. Vols I and II. J.L. Balcázar, J. Dı́az and J. Gabarró. Computability and Complexity fr...
متن کاملA Polynomial-time Exact Algorithm for the Subset Sum Problem
Subset sum problem, (SSP), is an important problem in complexity theory, it belongs to complexity class NP-Hard, therefore to find a polynomial-time exact algorithm that solves subset sum problem proves that P=NP. In the present paper it will be shown a theorem that allows us to develop, as described in the paper, an algorithm of polynomial-time complexity. For a deepening on complexity theory ...
متن کاملA Survey of Complexity Results
Recently several works about the computational complexity of planning appeared in the literature. In this paper we survey the main results in this area. We not only give results about the tractabil-ity/intractability of the individual problems but we also analyze sources of complexity and explain intuitively the nature of easy/hard cases.
متن کاملOn Computer Integrated Rationalized Crossword Puzzle Manufacturing
The crossword puzzle is a classic pastime that is well-known all over the world. We consider the crossword manufacturing process in more detail, investigating a two-step approach, first generating a mask, which is an empty crossword puzzle skeleton, and then filling the mask with words from a given dictionary to obtain a valid crossword. We show that the whole manufacturing process is NP-comple...
متن کاملA note on the Consecutive Ones Submatrix problem
A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1’s consecutive in every column. The problem of Consecutive Ones Property for a matrix is a special variant of Consecutive Ones Submatrix problem in which a positive integer K is given and we want to know if there exists a submatrix B of A consisting of K columns of A wi...
متن کامل